Approximation schemes for knapsack problems with shelf divisions
نویسندگان
چکیده
منابع مشابه
Approximation schemes for knapsack problems with shelf divisions
Given a knapsack of size K, non-negative values d and ∆, and a set S of items, each item e ∈ S with size se and value ve, we define a shelf as a subset of items packed inside a bin with total items size at most ∆. Two subsequent shelves must be separated by a shelf divisor of size d. The size of a shelf is the total size of its items plus the size of the shelf divisor. The Shelf-Knapsack Proble...
متن کاملApproximation Schemes for 0-1 Knapsack
We revisit the standard 0-1 knapsack problem. The latest polynomial-time approximation scheme by Rhee (2015) with approximation factor 1 + ε has running time near Õ(n+ (1/ε)5/2) (ignoring polylogarithmic factors), and is randomized. We present a simpler algorithm which achieves the same result and is deterministic. With more effort, our ideas can actually lead to an improved time bound near Õ(n...
متن کاملApproximation Algorithms for Constrained Knapsack Problems
We study constrained versions of the knapsack problem in which dependencies between items are given by a graph. In one version, an item can be selected only if one of its neighbours is also selected. In the other version, an item can be selected only when all its neighbours are also selected. These problems generalize and unify several problems including the prize collecting and budgeted maximu...
متن کاملOptimization Problems with Approximation Schemes
In this paper we extend recent work about the relationship between the syntactic description of NP optimization problems and their approximation properties. In contrast to Max SNP we consider problems that take arbitrary weighted structures as input instances and we use the framework of Metaanite Model Theory 5] to get a more general deenability theory of optimization problems. We deene a class...
متن کاملApproximation Algorithms for Knapsack Problems with Cardinality Constraintsy
We address a variant of the classical knapsack problem in which an upper bound is imposed on the number of items that can be selected. This problem arises in the solution of real-life cutting stock problems by column generation, and may be used to separate cover inequalities with small support within cutting plane approaches to integer linear programs. We focus our attention on approximation al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.10.036